Complexity classes - PDFSEARCH.IO - Document Search Engine

Complexity classes
Results: 1120

#	Item
211	ANNALS OF PURE AND APPLIED LOGIC Annals of Pure and Applied Logic276 Fixed-parameter tractability and completeness IV: Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-14 09:20:30 Complexity classes NP-complete problems Structural complexity theory Mathematical optimization Parameterized complexity Dominating set P versus NP problem NP-complete Combinatory logic Theoretical computer science Computational complexity theory Applied mathematics
212	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Covering Orthogonal Polygons with Sliding k-transmitters Salma Sadat Mahdavi∗ Saeed Seddighin Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-08-05 11:21:00 Complexity classes Polygons Structural complexity theory Mathematical optimization Art gallery problem Approximation algorithm Reduction NP-complete Optimization problem Theoretical computer science Computational complexity theory Applied mathematics
213	ICS 162 – Spring 2001 – Final Exam Name: Student ID: 1: Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2003-12-01 14:01:08 Applied mathematics Automata theory Models of computation Mathematical optimization NP Deterministic pushdown automaton Pushdown automaton P Complement Theoretical computer science Computational complexity theory Complexity classes
214	On Rank Aggregation of Multiple Orderings in Network Design Hadas Shachnai, Computer Science Dept., Technion, Haifa 32000, Israel Lisa Zhang, Bell Labs, Lucent Technologies, 600 Mountain Ave., Murray Hill, NJ 07974 Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2007-03-07 16:59:32 Complexity classes Mathematical optimization Structural complexity theory Conjectures Permutation NP Directed acyclic graph Optimization problem Approximation algorithm Theoretical computer science Computational complexity theory Applied mathematics
215	How to Go Beyond the Black-Box Simulation Barrier Boaz Barak∗ December 30, 2008 Abstract The simulation paradigm is central to cryptography. A simulator is an algorithm that tries Add to Reading List Source URL: www.boazbarak.org Language: English - Date: 2011-10-10 23:51:40 Probabilistic complexity theory Cryptographic protocols Computational complexity theory Complexity classes Zero-knowledge proof Interactive proof system IP Commitment scheme NP Theoretical computer science Applied mathematics Cryptography
216	1 Complexity of Algorithms Lecture Notes, SpringPeter G´acs Add to Reading List Source URL: www.cs.elte.hu Language: English - Date: 2010-10-17 05:06:21 Complexity classes Analysis of algorithms Probabilistic complexity theory Computational resources NP Time complexity P Randomized algorithm Theory of computation Theoretical computer science Computational complexity theory Applied mathematics
217	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Approximate Matching of Curves to Point Sets Paul Accisano ¨ or Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-06-20 23:59:44 Complexity classes NP Tangent MAX-3SAT Theoretical computer science Computational complexity theory Geometry
218	FA10_apps_adm_acc_new.xlsx Add to Reading List Source URL: grad.ucsd.edu Language: English - Date: 2014-10-31 13:42:31 Complexity classes NP Healthcare science Biomedical scientist Biological engineering Medicine Health Science
219	Space and energy efficient computation with DNA strand displacement systems Chris Thachuk and Anne Condon Department of Computer Science, University of British Columbia, Vancouver, BC, Canada Abstract. Chemical reaction Add to Reading List Source URL: www-devel.cs.ubc.ca Language: English - Date: 2012-06-17 22:22:27 Complexity classes True quantified Boolean formula NL Reversible computing PSPACE-complete PP DSPACE IP Computation Theoretical computer science Computational complexity theory Applied mathematics
220	Boolean Decision Functions Steven Finch April 22, 2015 Let  : {0 1} → {0 1} be the Boolean function that decides whether a given ( + 1)-bit odd integer is square-free. More precisely, ½ Add to Reading List Source URL: www.people.fas.harvard.edu Language: English - Date: 2015-04-21 10:31:24 Integer sequences Algebra Polynomials FO Computational complexity theory Prime number Primality test Square-free integer Irreducible polynomial Mathematics Theoretical computer science Complexity classes

UPDATE